Automated Design Debugging With Maximum Satisfiability

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automated Post-Silicon Debugging of Design Bugs

As design size and complexity increase in the modern IC design, more design bugs escape the pre-silicon verification process and slip into the silicon. Efficient automation of postsilicon debugging procedures helps to reduce debugging time and to increase diagnosis accuracy. This paper presents an automated approach for post-silicon debugging of design bugs by integrating post-silicon trace ana...

متن کامل

Automated Synthesis of Semantic Malware Signatures using Maximum Satisfiability

This paper proposes a technique for automatically learning semantic malware signatures for Android from very few samples of a malware family. The key idea underlying our technique is to look for a maximally suspicious common subgraph (MSCS) that is shared between all known instances of a malware family. An MSCS describes the shared functionality between multiple Android applications in terms of...

متن کامل

Maximum Satisfiability

The Boolean satisfiability problem (SAT) is the problem of deciding, given a Boolean expression in variables x1, · · · , xn, whether some assignment of the variables makes the expression true. SAT is historically notable because it was the first problem proven to be NP-complete. (Before this point, the idea of NP-completeness had been formulated, but no one had proven that there actually existe...

متن کامل

Sums of Squares, Satisfiability and Maximum Satisfiability

Recently the Mathematical Programming community showed a renewed interest in Hilbert’s Positivstellensatz. The reason for this is that global optimization of polynomials in IR[x1, . . . , xn] is NPhard, while the question whether a polynomial can be written as a sum of squares has tractable aspects. This is due to the fact that Semidefinite Programming can be used to decide in polynomial time (...

متن کامل

Efficient Model Based Diagnosis with Maximum Satisfiability

Model-Based Diagnosis (MBD) finds a growing number of uses in different settings, which include software fault localization, debugging of spreadsheets, web services, and hardware designs, but also the analysis of biological systems, among many others. Motivated by these different uses, there have been significant improvements made to MBD algorithms in recent years. Nevertheless, the analysis of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

سال: 2010

ISSN: 0278-0070,1937-4151

DOI: 10.1109/tcad.2010.2061270